Inclusions Characterizing Polynomial-Type Multifunctions

Inversion of multifunctions and differential inclusions

We present a new inverse mapping theorem for correspondences. It uses a notion of differentiability for multifunctions which seems to be new. We compare it with previous versions. We provide an application to differential inclusions.

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity

We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These characterizations provide a new insight on the complexit...

Characterizing Polynomial Ramsey Quantifiers

Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey quantifiers are either polynomial-time computable or NP-hard, and whether we can give a natural characterization of the polynomial-time computable quantifiers. In t...

Maximal Monotone Multifunctions of Brrndsted{rockafellar Type

Maximal Monotone Multifunctions of BrndstedRockafellar Type

We consider whether the “inequality-splitting” property established in the Brøndsted– Rockafellar theorem for the subdifferential of a proper convex lower semicontinuous function on a Banach space has an analog for arbitrary maximal monotone multifunctions. We introduce the maximal monotone multifunctions of type (ED), for which an “inequality-splitting” property does hold. These multifunctions...